Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs
نویسندگان
چکیده
منابع مشابه
Clique-Width and Directed Width Measures for Answer-Set Programming
Disjunctive Answer Set Programming (ASP) is a powerful declarative programming paradigm whose main decision problems are located on the second level of the polynomial hierarchy. Identifying tractable fragments and developing efficient algorithms for such fragments are thus important objectives in order to complement the sophisticated ASP systems available to date. Hard problems can become tract...
متن کاملThe Tree-Width Compactness Theorem for Hypergraphs
A hypergraph H has tree-width k (a notion introduced by Robertson and Seymour) if k is the least integer such that H admits a tree-decomposition of tree-width k. We prove a compactness theorem for this notion, that is, if every finite subhypergraph of H has tree-width < k, then H itself has tree-width < k. This result will be used in a later paper on well-quasi-ordering infinite graphs.
متن کاملTree-width of hypergraphs and surface duality
In Graph Minors III, Robertson and Seymour write:“It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal — indeed, we have convinced ourselves that they differ by at most one.” They never gave a proof of this. In this paper, we prove a generalisation of this statement to embedding of hypergraphs on general surfaces, and we prove that our ...
متن کاملLarge Hinge Width on Sparse Random Hypergraphs
Consider random hypergraphs on n vertices, where each k-element subset of vertices is selected with probability p independently and randomly as a hyperedge. By sparse we mean that the total number of hyperedges is O(n) or O(n lnn). When k = 2, these are exactly the classical Erdös-Rényi random graphs G(n, p). We prove that with high probability, hinge width on these sparse random hypergraphs ca...
متن کاملBrain Connectivity Hyper-Network for MCI Classification
Brain connectivity network has been used for diagnosis and classification of neurodegenerative diseases, such as Alzheimer's disease (AD) as well as its early stage, i.e., mild cognitive impairment (MCI). However, conventional connectivity network is usually constructed based on the pairwise correlation among brain regions and thus ignores the higher-order relationship among them. Such informat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.09.010